FQMR: A Flexible Quasi-Minimal Residual Method with Inexact Preconditioning
نویسندگان
چکیده
A flexible version of the QMR algorithm is presented which allows for the use of a different preconditioner at each step of the algorithm. In particular, inexact solutions of the preconditioned equations are allowed, as well as the use of an (inner) iterative method as a preconditioner. Several theorems are presented relating the norm of the residual of the new method with the norm of the residual of other methods, including QMR and flexible GMRES (FGMRES). In addition, numerical experiments are presented which illustrate the convergence of flexible QMR (FQMR), and show that in certain cases FQMR can produce approximations with lower residual norms than QMR.
منابع مشابه
Fqmr : a Flexible Quasi - Minimal Residual Methodwith Inexact Preconditioning ( Preliminary Report ) Daniel
A exible version of the QMR algorithm is presented which allows for the use of a diierent preconditioner at each step of the algorithm. In particular, inexact solutions of the preconditioned equations are allowed, as well as the use of some (inner) iterative method as a preconditioner. Several theorems are presented relating the norm of the residual of the new method with the norm of the residu...
متن کاملAn Efficient and Effective Nonlinear Solver in a Parallel Software for Large Scale Petroleum Reservoir Simulation
We study a parallel Newton-Krylov-Schwarz (NKS) based algorithm for solving large sparse systems resulting from a fully implicit discretization of partial differential equations arising from petroleum reservoir simulations. Our NKS algorithm is designed by combining an inexact Newton method with a rank-2 updated quasi-Newton method. In order to improve the computational efficiency, both DDM and...
متن کاملTwo recursive GMRES-type methods for shifted linear systems with general preconditioning
We present two minimum residual methods for solving sequences of shifted linear systems, the right-preconditioned shifted GMRES and shifted Recycled GMRES algorithms which use a seed projection strategy often employed to solve multiple related problems. These methods are compatible with general preconditioning of all systems, and when restricted to right preconditioning, require no extra applic...
متن کاملA Flexible Generalized Conjugate Residual Method with Inner Orthogonalization and Deflated Restarting
This work is concerned with the development and study of a minimum residual norm subspace method based on the generalized conjugate residual method with inner orthogonalization (GCRO) method that allows flexible preconditioning and deflated restarting for the solution of nonsymmetric or non-Hermitian linear systems. First we recall the main features of flexible generalized minimum residual with...
متن کاملA study on block flexible iterative solvers with applications to Earth imaging problem in geophysics
This work is concerned with the development and study of a minimum residual norm subspace method based on the Generalized Conjugate Residual method with inner Orthogonalization (GCRO) method that allows flexible preconditioning and deflated restarting for the solution of non-symmetric or non-Hermitian linear systems. First we recall the main features of Flexible Generalized Minimum Residual wit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Scientific Computing
دوره 23 شماره
صفحات -
تاریخ انتشار 2001